Another Look at Rejection Sampling Through Importance Sampling

نویسنده

  • Yuguo Chen
چکیده

We provide a different view of rejection sampling by putting it in the framework of importance sampling. When rejection sampling with an envelope function g is viewed as a special importance sampling algorithm, we show that it is inferior to the importance sampling algorithm with g as the proposal distribution in terms of the Chi-square distance between the proposal distribution and the target distribution. Similar conclusions are drawn for comparing rejection control with importance sampling. Some key words: Chi-square distance, Effective sample size; Importance sampling; Rejection control; Rejection sampling. Yuguo Chen is with Institute of Statistics and Decision Sciences, Duke University, Durham, NC 27708, USA (e-mail: [email protected]). This research was partly supported by the National Science Foundation grant DMS0203762.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Iterative and Non-iterative Simulation Algorithms

The Gibbs sampler, Metropolis’ algorithm, and similar iterative simulation methods are related to rejection sampling and importance sampling, two methods which have been traditionally thought of as non-iterative. We explore connections between importance sampling, iterative simulation, and importance-weighted resampling (SIR), and present new algorithms that combine aspects of importance sampli...

متن کامل

Large-Flip Importance Sampling

We propose a new Monte Carlo algorithm for complex discrete distributions. The algorithm is motivated by the N-Fold Way, which is an ingenious event-driven MCMC sampler that avoids rejection moves at any specific state. The N-Fold Way can however get “trapped” in cycles. We surmount this problem by modifying the sampling process. This correction does introduce bias, but the bias is subsequently...

متن کامل

Improving Importance Sampling by Adaptive Split-Rejection Control in Bayesian Networks

Importance sampling-based algorithms are a popular alternative when Bayesian network models are too large or too complex for exact algorithms. However, importance sampling is sensitive to the quality of the importance function. A bad importance function often leads to much oscillation in the sample weights, and, hence, poor estimation of the posterior probability distribution. To address this p...

متن کامل

Ancestral inference from haplotypes and mutations

We consider inference about the history of a sample of DNA sequences, conditional upon the haplotype counts and the number of segregating sites observed at the present time. After deriving some theoretical results in the coalescent setting, we implement rejection sampling and importance sampling schemes to perform the inference. The importance sampling scheme addresses an extension of the Ewens...

متن کامل

SampleSearch: A Scheme that Searches for Consistent Samples

Sampling from belief networks which have a substantial number of zero probabilities is problematic. MCMC algorithms like Gibbs sampling do not converge and importance sampling schemes generate many zero weight samples that are rejected, yielding an inefficient sampling process (the rejection problem). In this paper, we propose to augment importance sampling with systematic constraint-satisfacti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004